Analytic Models of Cyclic Service Systems and Their Application to Token-Passing Local Networks
نویسندگان
چکیده
Using the frameworK of cyclic-service systems with a single server, two different token-passing models are investigated. The first model is approximate, obtaining the free-taken's cycle-time distribution on an asymmetric system with infinite capacity buffers and single-token operation. The second model is exact. yielding the cycle-time distribution of the free-token on an asymmetric system with wtit-capacity buffers. and single-token operation. The latter result is verified using known results for symmetric, unit-capacity buffer systems. In order to demonsuate the positive effects of buffering, a small variation of the unit-capacity buffering scheme is introduced. Computational results include performance measures such as throughput, utilisation. loss probabilities, mean cycle-times. cycle-lime distributions and a comparison of two buffering schemes. • This research was supponcd by rho:. National So:.icncc FOUI'Idauon under gTalll ECS-83-04967.
منابع مشابه
Analytic Approach of Voice / Data Integration on Token Passing Lan ' S Based on Ieee 802 . 5
The increasing range 01 applications 01 local area networks (LAN) reflects their importance in todays inhouse communication. The requirements in office scenarios to support both, voice and data connections, locus the point 01 view to LAN systems, which are capable 01 integrating these different traffic streams. Recently, various LAN access schemes including voice communications have been develo...
متن کاملAn Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service
The cyclic server system has been the subject of considerable research over the last few years. Interest in analyzing such systems has gained momentum due to their application in the performance analysis of token ring networks. In this paper we consider cyclic server systems with nonexhaustive service discipline. The performance measures of interest here are the mean waiting times at the nodes ...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملClosed-network duals of multiqueues with application to token-passing systems
Asymmerric mulliqueue systems (e.g., Token-passing systems) are known to raise analytically difficult questions in the sense of modelling tractabilty. A prime example is the asymmetric multiqueue system with a single cyclic-server and one-at-a-lime customer service. In the interests of sound approximation techniques. we examine the feasibility of approximation schemes using known results in the...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 37 شماره
صفحات -
تاریخ انتشار 1988